Twenty Questions on Atherosclerosis

On Playing "Twenty Questions" with a Liar

We consider a version of the game “Twenty Questions” played on the set {0, · · · ,N − 1} where the player giving answersmay lie in her answers. The questioner is allowedQ questions and the responder may lie in up to rQ of the answers, for some fixed and previously known fraction r. Under various models of this game and different question classes, we give precise conditions (i.e. tight bounds on...

Discussion of Twenty Questions Problem

Discuss several tricks for solving twenty question problems which in this paper is depicted as a guessing game. Player tries to find a ball in twenty boxes by asking as few questions as possible, and these questions are answered by only “Yes” or “No”. With the discussion, demonstration of source coding methods is the main concern.

Shape Recognition and Twenty Questions

Twenty Questions for the Midterm

1. Assume everything you know from the notes on Riemann-Stieltjes integration. (a) Show that if g : [0, 1]→ R is Riemann-integrable on [0, 1] and φ : [a, b]→ R is continuous on an interval [a, b] ⊇ g[[0, 1]], then φ ◦ g is Riemann-integrable on [0, 1]. (b) Assume that f : [0, 1]→ R is a function for which f ′(t) exists at each t ∈ [0, 1] (one-sidedly at endpoints) and that the Riemann integral ...

Twenty Questions for the Final

1. (a) Let (X, ‖ · ‖) and (Y, ‖ · ‖) be normed spaces. Show that the following conditions on a family T ⊆ L(X, Y ) are logically equivalent: (1) {‖T ‖ : T ∈ T} is bounded in R; (2) {T : T ∈ T} is equicontinuous at some point of X ; (3) {T : T ∈ T} is equicontinuous at 0 ∈ X ; (4) {T : T ∈ T} is equicontinuous at every point of X . (This order may not be the most efficient one to prove round-rob...